On trees with a maximum proper partial 0-1 coloring containing a maximum matching
نویسنده
چکیده
I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0 − 1 coloring such that the edges colored by 0 form a maximum matching.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملSolving Matching Problems Efficiently in Bipartite Graphs
We investigate the problem maxDMM of computing a largest set of pairwise disjoint maximum matchings in undirected graphs as introduced by P. J. Slater in the case of trees. In this paper, n, m denote, respectively, the number of vertices and the number of edges. We solve maxDMM for bipartite graphs, by providing an O(n 1.5 m/ log n + mn log n)-time algorithm. We design better algorithms for com...
متن کاملHarmonious coloring of trees with large maximum degree
A harmonious coloring of G is a proper vertex coloring of G such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of G, h(G), is the minimum number of colors needed for a harmonious coloring of G. We show that if T is a forest of order n with maximum degree ∆(T ) ≥ n+2 3 , then h(T ) = { ∆(T ) + 2, if T has non-adjacent vertices of degr...
متن کاملOn the parameter μ21 of a complete bipartite graph
A proper edge t-coloring of a graph G is a coloring of edges of G with colors 1, 2, ..., t such that all colors are used, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex x is called a spectrum of x. An arbitrary nonempty subset of consecutive integers is called an interval. Suppose that all edges of a graph G are colored in the game of Alice a...
متن کاملBatch Coloring Flat Graphs and Thin
Batch scheduling of conflicting jobs is modeled by batch coloring of a graph. Given an undirected graph and the number of colors required by each vertex, we need to find a proper batch coloring of the graph, namely, to partition the vertices to batches which are independent sets and assign to each batch a contiguous set of colors, whose size is equal to the maximum color requirement of any vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006